Toward Fair Comparisons of Binomial Sequential Sampling Plans

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparisons of Sequential Procedures for Selecting the Best Binomial Population

Recently the problem of selecting the best one of several binomial populations has been studied from the point of view of different sampling rules. In this paper, we compare some sequential procedures with and without early elimination. The main breakdown is between those using the cyclic play the winner (PWC) sampling rule and those using the vector at a time (VT) sampling rule. The PWC rule o...

متن کامل

Binomial Sampling and the Binomial Distribution

This is a good place to point out that these are only (approximating) , and not full truth. models Truth is not a model. A model, by definition, is an approximation (and not truth). In fact, out of a few million coin flips, one or more coins will remain standing on edge – that is truth. The binomial model does not allow such reality. The idea is more easily understood for the outcomes “dead" or...

متن کامل

Sequential Sampling Plan with Fuzzy Parameters

In this paper a new sequential sampling plan is introduced in which the acceptable quality level (AQL) and the lot tolerance percent defective (LTPD) are a fuzzy number. This plan is well defined, since, if the parameters are crisp, it changes to a classical plan. For such a plan, a particular table of rejection and acceptance is calculated and compared with the classical one. Keywords : St...

متن کامل

On Fair Exchange, Fair Coins and Fair Sampling

We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities) and discover three levels of complexity for them. Our results include the following: – Fair exchange cannot be securely reduced to the problem of fair cointossing by an r-round protocol, except w...

متن کامل

Identifying Dynamic Sequential Plans

We address the problem of identifying dynamic sequential plans in the framework of causal Bayesian networks, and show that the problem is reduced to identifying causal effects, for which there are complete identification algorithms available in the literature.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Entomologist

سال: 2000

ISSN: 2155-9902,1046-2821

DOI: 10.1093/ae/46.4.250